Task Allocation onto a Hypercube
نویسنده
چکیده
An eecient recursive task allocation scheme, based on the Kernighan-Lin mincut bi-section heuristic, is proposed for the eeective mapping of tasks of a parallel program onto a hypercube parallel computer. It is evaluated by comparison with an adaptive, scaled simulated annealing method. The recursive allocation scheme is shown to be eeective on a number of large test task graphs { its solution quality is nearly as good as that produced by simulated annealing, and its computation time is several orders of magnitude less.
منابع مشابه
Task Allocation onto a Hypercube by Recursive
An eecient recursive task allocation scheme, based on the Kernighan-Lin mincut bi-section heuristic, is proposed for the eeective mapping of tasks of a parallel program onto a hypercube parallel computer. It is evaluated by comparison with an adaptive, scaled simulated annealing method. The recursive allocation scheme is shown to be eeective on a number of large test task graphs { its solution ...
متن کاملA Graph-Based Subcube Allocation and Task Migration in Hypercube Systems
In this paper, we propose a task migration scheme based on the HSA (Heuristic Subcube Allocation) strategy to solve the fragmentation problem in a hypercube. Extensive simulation results show that the migration scheme improves the ejjkiency and signijicantly reduces the migration cost compared to the previously proposed schemes.
متن کاملModels for Scheduling Task Graphs onto Hypercube Systems
Given a set of m tasks with a precedence constraint P and a communication requirement C, where each task has execution time and a subcube requirement, the Hypercube Task Scheduling Problem (HTSP) is to nd an assignment of tasks which minimizes the total completion time. In this paper, we show that HTSP and its many restricted versions are NP-hard. This motivates the development of heuristic alg...
متن کاملFault Tolerance in Hypercubes
This paper describes different schemes for tolerating faults in hypercube multiprocessors. A study of hypercube algorithms reveals that in many cases, the computations that require local communication are mapped onto topologies such as meshes or rings and the hypercube topology is used for global data communication. Therefore, a faulty hypercube needs to be reconfigured to perform both local an...
متن کاملProcessor allocation strategies for modified hypercubes - Computers and Digital Techniques, IEE Proceedings-
Modified hypercubes (MHs) have been proposed as building blocks for hypercube-based parallel systems that support the application of incremental growth techniques. In contrast, systems implementing the standard hypercube network cannot be expanded in practice. However, processor allocation for MHs is a more difticult task due to a slight deviation in their topology from that of the standard hyp...
متن کامل